Herbrand Theorems and Skolemization for Prenex Fuzzy Logics
نویسندگان
چکیده
Approximate Herbrand theorems are established for first-order fuzzy logics based on continuous t-norms, and used to provide proof-theoretic proofs of Skolemization for their Prenex fragments. Decidability and complexity results for particular fragments are obtained as consequences.
منابع مشابه
Herbrand Theorems for Substructural Logics
Herbrand and Skolemization theorems are obtained for a broad family of first-order substructural logics. These logics typically lack equivalent prenex forms, a deduction theorem, and reductions of semantic consequence to satisfiability. The Herbrand and Skolemization theorems therefore take various forms, applying either to the left or right of the consequence relation, and to restricted classe...
متن کاملHerbrand Theorems: the Classical and Intuitionistic Cases
A unified approach is applied for the construction of sequent forms of the famous Herbrand theorem for first-order classical and intuitionistic logics without equality. The forms do not explore skolemization, have wording on deducibility, and as usual, provide a reduction of deducibility in the first-order logics to deducibility in their propositional fragments. They use the original notions of...
متن کاملHerbrand-type Theorems: the Classical and Intuitionistic Cases
A unified approach to the construction of original forms of the famous Herbrand theorem is suggested for first-order classical and intuitionistic logics without equality. It does not explore skolemization, have wording on deducibility, and as usual, makes the reduction of deducibility in the first-order logics to deducibility in their propositional fragments. The forms use the original notions ...
متن کاملA Decision Procedure for Herbrand Formulae without Skolemization
This paper describes a decision procedure for disjunctions of conjunctions of anti-prenex normal forms of pure first-order logic (FOLDNFs) that do not contain ∨ within the scope of quantifiers. The disjuncts of these FOLDNFs are equivalent to prenex normal forms whose quantifier-free parts are conjunctions of atomic and negated atomic formulae (= Herbrand formulae). In contrast to the usual alg...
متن کاملA Resolution Mechanism for Prenex Gödel Logic
First order Gödel logic G∞, enriched with the projection operator 4—in contrast to other important t-norm based fuzzy logics, like Lukasiewicz and Product logic—is well known to be recursively axiomatizable. However, unlike in classical logic, testing (1-)unsatisfiability, i.e., checking whether a formula has no interpretation that assigns the designated truth value 1 to it, cannot be straightf...
متن کامل